Multiobjective Green Time-Dependent Location-Routing Problem and Algorithms

To reduce the logistic cost and carbon emission improve customer satisfaction, this study proposes a multiobjective green time-dependent location routing problem (MOGTDLRP) model in which objectives are to minimize distribution total cost, delivery time, fuel consumption. This will be solved by several hyperheuristic algorithms include high-level heuristics low-level heuristics. There three acceptance criterions for solution: improving equal, all moves accept solutions, dynamic criteria. Through case, performance of algorithm influence various factors on solution analyzed study. The experimental results show that proposed can effectively costs, emissions, vehicle travel time.